Skip to content

Conversation

@saintmedusa
Copy link

No description provided.

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks for getting this in. The solutions look good overall. Take a look at my comments and let me know what questions you have.

@@ -1,3 +1,23 @@
def intersection(list1, list2)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

if middle_char == nil
return false
end
char_counts.delete_at(middle_char)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This works, but if I can suggest, just count the number of letters which appear an odd number of times and it should be less than or equal to 1.

@@ -1,4 +1,18 @@

def permutations?(string1, string2)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants